Primitively Decomposable rpp Semigroups

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-Decomposable Quantum Dynamical Semigroups and Bound Entangled States

We use open quantum system techniques to construct one-parameter semigroups of positive maps and apply them to study the entanglement properties of a class of 16-dimensional density matrices, representing states of a 4× 4 bipartite system.

متن کامل

Primitively Rational Belief-Forming Processes

One approach to understanding “reasons”—including both reasons for action and reasons for belief—postulates a fundamental connection between reasons and reasoning. According to this approach, there is a reason for you to φ—where φ-ing could be either an action (such as writing a letter) or an attitude (such as believing that it is snowing)—if and only if there is a possible process of sound or ...

متن کامل

Constructing vertex decomposable graphs

‎Recently‎, ‎some techniques such as adding whiskers and attaching graphs to vertices of a given graph‎, ‎have been proposed for constructing a new vertex decomposable graph‎. ‎In this paper‎, ‎we present a new method for constructing vertex decomposable graphs‎. ‎Then we use this construction to generalize the result due to Cook and Nagel‎.

متن کامل

Decomposable Constraints

Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints. Certain classes of these non-binary constraints are “network decomposable” as they can be represented by binary constraints on the same set of variables. We compare theoretically the levels of consistency which are achieved o...

متن کامل

Decomposable theories

We present in this paper a general algorithm for solving first-order formulas in particular theories called decomposable theories. First of all, using special quantifiers, we give a formal characterization of decomposable theories and show some of their properties. Then, we present a general algorithm for solving first-order formulas in any decomposable theory T . The algorithm is given in the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pure Mathematics

سال: 2012

ISSN: 2160-7583,2160-7605

DOI: 10.12677/pm.2012.24039